Full-Information Lookups for Peer-to-Peer Overlays
نویسندگان
چکیده
منابع مشابه
Two Hop Lookups for Large Scale Peer-to-Peer Overlays
Most current peer-to-peer lookup algorithms keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. Lookups have high latency as each lookup requires contacting several nodes in sequence. In [2] we proposed a one hop lookup scheme, which scales up to systems of around ten million nodes. Lookups take only one hop most of the time, and this enables a l...
متن کاملOne Hop Lookups for Peer-to-Peer Overlays
Current peer-to-peer lookup algorithms have been designed with the assumption that routing information at each member node must be kept small, so that the bookkeeping required to respond to system membership changes is also small. In this paper, we show that this assumption is unnecessary, and present a technique that maintains complete routing tables at each node. The technique is able to hand...
متن کاملLookup-Ring: Building Efficient Lookups for High Dynamic Peer-to-Peer Overlays
This paper is motivated by the problem of poor searching efficiency in decentralized peer-to-peer file-sharing systems. We solve the searching problem by considering and modeling the basic trade-off between forwarding queries among peers and maintaining lookup tables in peers, so that we can utilize optimized lookup table scale to minimize bandwidth consumption, and to greatly improve the searc...
متن کاملEfficient Routing for Peer-to-Peer Overlays
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing information at each member node must be kept small, so that the bookkeeping required to respond to system membership changes is also small, given that aggressive membership dynamics are expected. As a consequence, lookups ...
متن کاملRandom Graphs for Peer-to-Peer Overlays
Modern peer-to-peer networks consist of several network layers and distributed algorithms providing features like indexing, ressource balancing, entry protocols, security, anonymity, and cryptography. Since peer-to-peer networks are highly dynamic, a fundamental task in the design of these networks is to provide high connectivity. We propose a solution by distributed random link exchange algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2009
ISSN: 1045-9219
DOI: 10.1109/tpds.2008.222